A minimum degree result for disjoint cycles and forests in bipartite graphs
نویسندگان
چکیده
Let F = (U1, U2;W ) be a forest with |U1| = |U2| = s, where s ≥ 2, and let G = (V1, V2, E) be a bipartite graph with |V1| = |V2| = n ≥ 2k + s, where k is a nonnegative integer. Suppose that the minimum degree of G is at least k+ s. We show that if n > 2k+ s then G contains the disjoint union of the forest F and k disjoint cycles. Moreover, if n = 2k+ s, then G contains the disjoint union of the forest F , k − 1 disjoint cycles and a path of order 4.
منابع مشابه
Disjoint Chorded Cycles of the Same Length
Corrádi and Hajnal [1] showed that any graph of order at least 3k with minimum degree at least 2k contains k vertex-disjoint cycles. This minimum degree condition is sharp, because the complete bipartite graph K2k−1,n−2k+1 does not contain k vertex-disjoint cycles. About the existence of vertex-disjoint cycles of the same length, Thomassen [4] conjectured that the same minimum degree condition ...
متن کاملDecomposing Graphs of High Minimum Degree into 4-Cycles
If a graph G decomposes into edge-disjoint 4-cycles, then each vertex of G has even degree and 4 divides the number of edges in G. It is shown that these obvious necessary conditions are also sufficient when G is any simple graph having minimum degree at least ( 32 + on(1))n, where n is the number of vertices in G. This improves the bound given by Gustavsson (1991), who showed (as part of a mor...
متن کاملNote on Vertex-Disjoint Cycles
Häggkvist and Scott asked whether one can find a quadratic function q(k) such that if G is a graph of minimum degree at least q(k), then G contains vertex-disjoint cycles of k consecutive even lengths. In this paper, it is shown that if G is a graph of average degree at least k + 19k + 12 and sufficiently many vertices, then G contains vertex-disjoint cycles of k consecutive even lengths, answe...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملDisjoint hamiltonian cycles in bipartite graphs
Let G = (X, Y ) be a bipartite graph and define σ 2(G) = min{d(x) + d(y) : xy / ∈ E(G), x ∈ X, y ∈ Y }. Moon and Moser [5] showed that if G is a bipartite graph on 2n vertices such that σ 2(G) ≥ n + 1 then G is hamiltonian, sharpening a classical result of Ore [6] for bipartite graphs. Here we prove that if G is a bipartite graph on 2n vertices such that σ 2(G) ≥ n+ 2k− 1 then G contains k edge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 29 شماره
صفحات -
تاریخ انتشار 2004